NOTE ON APPROXIMATIONS FOR THE MULTISERVER QUEUE WITH FINITE BUFFER AND DETERMINISTIC SERVICES
نویسندگان
چکیده
منابع مشابه
Note on Approximations for the Multiserver Queue with Finite Buffer and Deterministic Services
This article extends an earlier article by Tijms and Staats [3] in which approximations were obtained for state probabilities and the waiting times in the single server M/D/1/N queue with finite buffer and deterministic services. These approximation were provided in the form of explicit expressions involving geometric distributions and exponential densities. The underlying idea of the approxima...
متن کاملOn a Multiserver Finite Buffer Queue with Impatient
In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many ap...
متن کاملMultiserver bulk service discrete-time queue with finite buffer and renewal input
This paper analyzes a discrete-time finite-buffer multi-server bulk-service queueing system in which the interarrival-and service-times are, respectively, arbitrarily and geometrically distributed. Using the supplementary variable and the imbedded Markov-chain techniques, the queue is analyzed for the early arrival system. We obtain state probabilities at prearrival, arbitrary and outside obser...
متن کاملA Finite-Source Multiserver Queue with Preemptive Priorities
We consider systems with finite sources of requests, multiple servers, and an arbitrary number of preemptive priority classes. The service times and the source idle times are assumed to be exponentially distributed. We present an efficient approach based on marginal state description. The approach allows a recurrent analysis of priority levels where the usage of servers by higher priority reque...
متن کاملA finite buffer queue with priorities
We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2008
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s0269964808000375